On Hamiltonian Cycles through Prescribed Edges of a Planar Graph
نویسنده
چکیده
We use [3] for terminology and notation not defined here and consider finite simple graphs only. The first major result on the existence of hamiltonian cycles in graphs embeddable in surfaces was by H. Whitney [12] in 1931, who proved that 4-connected maximal planar graphs are hamiltonian. In 1956, W.T. Tutte [10,11] generalized Whitney’s result from maximal planar graphs to arbitrary 4-connected planar graphs. Actually, Tutte proved that a 4-connected planar graph G has a hamiltonian cycle through any two edges of a given face of G. Moreover, in [7,8] it is proved that a 4-connected planar graph G has a hamiltonian cycle through any three edges of a given face of G or that face is a 3-gon. Improving a result of C. Thomassen [9], in 1997, D.P. Sanders [7] proved the following:
منابع مشابه
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
In 1956, W.T. Tutte proved that a 4-connected planar graph is hamiltonian. Moreover, in 1997, D.P. Sanders extended this to the result that a 4-connected planar graph contains a hamiltonian cycle through any two of its edges. We prove that a planar graph G has a cycle containing a given subset X of its vertex set and any two prescribed edges of the subgraph of G induced by X if |X| ≥ 3 and if X...
متن کاملOn certain Hamiltonian cycles in planar graphs
The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that must be present in a 5-connected graph that is embedded into the plane or into the projective plane ...
متن کاملCounting Hamiltonian cycles on planar random lattices
Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles is obtained and its singularity is studied. Hamiltonian cycles have often been used to model collapsed polymer globules[1]. A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. The number of Hamiltonian cycles on a lattice cor...
متن کاملQuantum Computing Hamiltonian Cycles
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths initiating from a chosen vertex, and furthermore to subsequently project out all states not corresponding to Hamiltonian cycles. A Hamiltonian cycle is a pat...
متن کاملHamiltonian cycles and paths with prescribed edges in hypercubes
The n-dimensional hypercube Qn is a graph whose vertex set consists of all binary vectors of length n, two vertices being adjacent whenever the corresponding vectors differ in exactly one coordinate. It is well-known that Qn is hamiltonian for every n ≥ 2 and the research on hamiltonian cycles satisfying certain additional properties has received a considerable attention ([7]). The applications...
متن کامل